Efficient reconstruction of partitions
نویسندگان
چکیده
منابع مشابه
Efficient reconstruction of partitions
We consider the problem of reconstructing a partition x of the integer n from the set of its tsubpartitions. These are the partitions of the integer n − t obtained by deleting a total of t from the parts of x in all possible ways. It was shown (in a forthcoming paper) that all partitions of n can be reconstructed from t-subpartitions if n is sufficiently large in relation to t. In this paper we...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملReconstruction of Partitions
For the partition x = [x1 ≥ x2 ≥ · · · ≥ xk] of the integer n = ∑ i xi a t-deletion is a partition y = [y1 ≥ y2 ≥ · · · ≥ yk] with xi ≥ yi ≥ 0 and ∑ i (xi−yi) = t. We prove that all partitions of n are reconstructible from their t–deletions if n is sufficiently large in relation to t.
متن کاملEfficient Computation of Restricted Partitions
Have you ever wondered how many ways the total of 5 dollars can be made with coins having cent values {1, 2, 5, 10, 20, 50, 100, 200}? Would you like to take a guess at how many ways there are? Would you be surprised if I told you there were 6295434? Maybe we should tone it down a bit and ask how many ways there are to make 50 cents. There are still 451! Lets step back once more and determine h...
متن کاملEfficient algorithms for path partitions
An [a, b] path partition is a decomposition of the edges of a graph into a independent path sets and b matchings, where an independent path set is a set of paths that do not intersect each other. The path partition problem is related to other edge partition problems, such as edge coloring. It is shown that every graph with maximum degree 3 has a [LO] path partition, and every graph with maximum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.037